Finding the minimal set for collapsible graphical models

Fixed-Parameter Algorithms for Finding Minimal Models

Computing minimal models is an important task in Knowledge Representation and Reasoning that appears in formalisms such as circumscription, diagnosis and answer set programming. Even the most basic question of whether there exists a minimal model containing a given variable is known to be Σ2 -complete. In this work we study the problem of computing minimal models from the viewpoint of parameter...

Finding minimal generating set for metabolic network with reversible pathways

Elementary flux modes give a mathematical representation of metabolic pathways in metabolic networks satisfying the constraint of non-decomposability. The large cost of their computation shifts attention to computing a minimal generating set which is a conically independent subset of elementary flux modes. When a metabolic network has reversible reactions and also admits a reversible pathway, t...

CpG Island Finding Using Graphical Models

CpG islands are short stretches in DNA sequence whose frequency of cytosine(C)and guanine (G) is higher than background of DNA sequence. They are around the promoter of frequently expressed genes. The conventional way to recognize CpG islands is to use the hidden Markov models (HMMs). While HMMs are known to suffer from not being able to capture long dynamic range information, they usually does...

Finding the Set of All Minimal Nested Convex Polygons

On the computational complexity of finding a minimal basis for the guess and determine attack

Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...